Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Adversarial example detection algorithm based on quantum local intrinsic dimensionality
Yu ZHANG, Yan CHANG, Shibin ZHANG
Journal of Computer Applications    2024, 44 (2): 490-495.   DOI: 10.11772/j.issn.1001-9081.2023020172
Abstract96)   HTML1)    PDF (1918KB)(41)       Save

In order to solve the high time complexity problem of the adversarial example detection algorithm based on Local Intrinsic Dimensionality (LID), combined with the advantages of quantum computing, an adversarial example detection algorithm based on quantum LID was proposed. First, the SWAP-Test quantum algorithm was used to calculate the similarity between the measured example and all examples in one time, avoiding the redundant calculation in the classical algorithm. Then Quantum Phase Estimation (QPE) algorithm and quantum Grover search algorithm were combined to calculate the local intrinsic dimension of the measured example. Finally, LID was used as the evaluation basis of the binary detector to detect and distinguish the adversarial examples. The detection algorithm was tested and verified on IRIS, MNIST, and stock time series datasets. The simulation experimental results show that the calculated LID values can highlight the difference between adversarial examples and normal examples, and can be used as a detection basis to differentiate example attributes. Theoretical research proves that the time complexity of the proposed detection algorithm is the same order of magnitude as the product of the number of iterations of Grover operator and the square root of the number of adjacent examples and the number of training examples, which is obviously better than that of the adversarial example detection algorithm based on LID and achieves exponential acceleration.

Table and Figures | Reference | Related Articles | Metrics
Dynamic classification of trust for Web services
Yan CHANG
Journal of Computer Applications    2011, 31 (07): 1880-1883.   DOI: 10.3724/SP.J.1087.2011.01880
Abstract1490)      PDF (601KB)(657)       Save
Based on existing research about classification of trust, the inaccuracy of trust classification for web services is analyzed and plan for classifying trust dynamically is put forward. From the angle of rationality and flexibility of defining trust attributes, intuitionistic fuzzy number is used to describe trust signature. Inherent capability, security characteristic and reputation are considered as the main signature to describe trust. Contribution degree of Inherent capability, security characteristic and reputation are calculated. Similarity matrix of trust intuitionistic fuzzy sets is constructed. Intuitionistic fuzzy equivalent matrix is got by calculating transitive closure. And trust classification is obtained by defining threshold cutting matrix. Validity and accuracy of dynamic classification is verified.
Reference | Related Articles | Metrics